Reciprocal calibration for channel estimation based on second-order statistics

ABSTRACT

A wireless communication method includes receiving, by a first wireless device during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas, estimating, by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device, and performing channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number.

This patent document is a 371 of International Application No. PCT/US2019/037095, filed Jun. 13, 2019, which claims priority to and benefits of U.S. Provisional Application No. 62/684,594 entitled “SECOND ORDER STATISTICS FOR EFFICIENT CHANNEL ESTIMATION,” filed on Jun. 13, 2018 and U.S. Provisional Application No. 62/726,822 entitled “RECIPROCITY CALIBRATION IN WIRELESS COMMUNICATIONS,” filed on Sep. 4, 2018. The entire contents of the aforementioned patent applications are incorporated by reference as part of the disclosure of this patent document.

TECHNICAL FIELD

The present document relates to wireless communication, and more particularly, precoding of wireless signals for transmission.

BACKGROUND

Due to an explosive growth in the number of wireless user devices and the amount of wireless data that these devices can generate or consume, current wireless communication networks are fast running out of bandwidth to accommodate such a high growth in data traffic and provide high quality of service to users.

Various efforts are underway in the telecommunication industry to come up with next generation of wireless technologies that can keep up with the demand on performance of wireless devices and networks. Many of those activities involve situations in which a large number of user devices may be served by a network.

SUMMARY

This document discloses techniques for channel estimation. In one example, a reciprocal calibration technique is used. In another example, a minimal set of resource elements and an estimate of second order statistics of the channel are used.

In an example aspect, a wireless communication method is disclosed. The method includes receiving, by a first wireless device during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas; estimating, by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device; and performing channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number.

In another example aspect, a method of wireless communication is disclosed. The method includes transmitting, to multiple receive antennas of a first wireless device from a transmit antenna of a second wireless device, during a training phase, reference tones using a first number of resource elements of a wireless channel between the transmit antenna and the multiple receive antennas; receiving, at an end of the training phase, an instruction to transmit reference tones using a second number of resource elements; and transmitting, during an operational phase after the training phase, reference tones to the multiple receive antennas of the first wireless device using the second number of resource elements, wherein the second number is different from the first number and wherein the second number is based on an estimated second order statistics of the wireless channel.

In yet another example aspect, a method of wireless communication is disclosed. The method includes estimating, during a training phase, a second order statistics for a first wireless channel and a second wireless channel between a transmitter and a receiver comprising multiple antennas, wherein the second order statistics is estimated using reference tones transmitted on a first number of resource elements; predicting, during an operational phase subsequent to the training phase, an estimate of the second wireless channel based on the second order statistics and an estimate of the first wireless channel calculated using reference tones transmitted on a second number of resource elements, where the second number is less than the first number; and communicating, during the operational phase, over the second wireless channel using the estimate of the second wireless channel resulting from the predicting; wherein the first wireless channel and the second wireless channel include non-overlapping frequencies.

In yet another example aspect, a method of wireless communication is disclosed. The method includes receiving, by a first communication device, a number of subcarriers from a second communication device, each including a corresponding reference signal; calculating an inversion factor for each subcarrier based on a received value of the corresponding reference signal; and transmitting by the first communication device to the second communication device, at least some of the subcarriers by scaling a pilot signal using a corresponding inversion factor.

In yet another example aspect, a method of wireless communication is disclosed. The method includes transmitting, to a first communication device, from a second communication device, a number of subcarriers, each subcarrier including a corresponding reference signal; receiving, from the first communication device, at least some of the subcarriers carrying pilot signals scaled by inversions factors for the subcarriers; and estimating a communication channel between the second communication device to the first communication device using the inversion factors.

In yet another example aspect, a wireless communication apparatus that implements the above-described methods is disclosed.

In yet another example aspect, the methods may be embodied as processor-executable code and may be stored on a computer-readable program medium.

In yet another example aspect, a wireless communication system that operates by providing a single pilot tone for channel estimation is disclosed.

These, and other, features are described in this document.

DESCRIPTION OF THE DRAWINGS

Drawings described herein are used to provide a further understanding and constitute a part of this application. Example embodiments and illustrations thereof are used to explain the technology rather than limiting its scope.

FIG. 1 shows an example of a fixed wireless access network.

FIG. 2 shows another example of a fixed wireless access network.

FIG. 3A shows an example of a wireless channel between a transmitter and a receiver device.

FIG. 3B shows another example of a wireless channel between a transmitter and a receiver device.

FIG. 3C shows an example of a wireless channel between a single transmit antenna and multiple receive antennas.

FIG. 4 is a graph showing an example of effect of number of tones used for reference signal transmissions on average error covariance.

FIG. 5 shows an example of a mobile wireless communication network with a multi-antenna base-station and multiple user antennas.

FIG. 6 shows an example of FDD prediction setup, wherein the base-station uses the channel response of the uplink to predict the channel response of the downlink in a different frequency and on a later subframe.

FIG. 7 shows examples of bandwidth partitions.

FIG. 8 shows an example of a bandwidth partition with the same time interval for reference signal (RS) 1 and RS2.

FIG. 9 shows an example of a bandwidth partition with different time intervals for reference signal (RS) 1 and RS2.

FIG. 10 shows an example of channel prediction over the same time interval.

FIG. 11 shows an example of channel prediction over a different time interval.

FIG. 12 shows an example of a wireless channel with reciprocity.

FIG. 13 shows an example antenna configuration in which four transmit and four receive antennas are used at a network-side apparatus.

FIG. 14 shows an example antenna configuration in a user-side communications apparatus.

FIG. 15 shows a block diagram for an example implementation of reciprocity calculation.

FIG. 16 shows an example of a wireless transceiver apparatus.

FIG. 17 shows an example communication network.

FIG. 18 is a flowchart for an example wireless communication method.

FIG. 19 is a flowchart for another example wireless communication method.

FIG. 20 is a flowchart for another example wireless communication method.

FIG. 21 is a flowchart for another example wireless communication method.

FIG. 22 is a flowchart for another example wireless communication method.

DETAILED DESCRIPTION

To make the purposes, technical solutions and advantages of this disclosure more apparent, various embodiments are described in detail below with reference to the drawings. Unless otherwise noted, embodiments and features in embodiments of the present document may be combined with each other.

Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion or embodiments (and/or implementations) to the respective sections only.

Channel knowledge is an important component in wireless communication, whether it is for a receiver to equalize and decode the received signal, or for a multi-antenna transmitter to generate a more efficient precoded transmission.

Typically, channel knowledge is acquired by transmitting known reference signals (pilots) and interpolating observations and results obtained by receiving them at the receiver over the entire bandwidth and time of interest. The density of the reference signals may depend on the characteristics of the channel. Higher delay spreads and higher Doppler spreads may require denser reference signals along frequency and/or time respectively, thus, occupying a considerable amount of the available capacity.

For example, consider a downlink multi-carrier transmission from a base-station to multiple users. In this case, depending on channel conditions, the reference signals should be dense enough in the time-frequency grid to allow the users to correctly estimate the channel and equalize the data (e.g., the estimation error due to interpolation of channel estimates along the time-frequency grid should be minimized). Another example is that of an uplink transmission from multi-users to a base station equipped with multi-antennas, where each user needs to allocate resource elements for its own reference signals.

In this document, we propose (i) an efficient method for estimating the channel from a very small set of resource elements, using the second-order statistics of the channel, and (ii) using the second-order statistics to reciprocally calibrate the wireless channel. The effectiveness of (i) increases with increased number of antennas at the base-station. As further described below, in some cases, it may be possible to send a single reference signal (tone) from the transmit antenna to each receive antenna at the base station, and be able to determine channel at different times and in different frequency bands based on the channel estimate obtained from the single (or, in general, reduced number of) reference tones. The efficacy of (ii) is based on deriving knowledge of the non-reciprocal parts of a channel between two nodes, and adjusting the channel response such that precoding may be used for the transmissions.

In the description, the example of a fixed wireless access (FWA) system is used only for illustrative purpose and the disclosed techniques can apply to other wireless networks, such as cellular or mobile communication networks further described in the present document.

FIG. 1 shows an example of a fixed wireless access system 100. A hub 102, that includes a transmission facility such as a cell tower, is configured to send and receive transmissions to/from multiple locations 104. For example, the locations could be user premises or business buildings. As described throughout this document, the disclosed embodiments can achieve very high cell capacity fixed wireless access, when compared to traditional fixed access technology. Some techniques disclosed herein can be embodied in implementations at the hub 102 or at transceiver apparatus located at the locations 104.

FIG. 2 shows yet another configuration of a fixed access wireless communication system 200 in which hops are used to reach users. For example, one cell tower may transmit/receive from another cell tower, which would then relay the transmissions between the principle cell tower and the users, thus extending range of the fixed wireless access system. A backhaul may connect the transmission tower 202 with an aggregation router. For example, in one configuration, a 10 Gbps fiber connection may be used to feed data between a base station at a hub and a fiber hub aggregation router. In one advantageous aspect, deployment of this technology can be achieved without having to change any network bandwidth characteristics for harder to reach areas by using the hub/home access point (AP) configuration as a launch point. Some techniques disclosed herein can be embodied in implementations at the macro tower 202 or at transceiver apparatus located at the other locations.

1. Introduction to Embodiments for Reciprocal Calibration for Channel Estimation Based on Second-Order Statistics

FIGS. 3A, 3B and 3C show simplified wireless networks to highlight certain aspects of the disclosed technology. A transmitter transmits wireless signals to a receiver in the wireless network. Some transmissions in the network, variously called as downstream or downlink transmissions, a network-side node such as a base station acts as a transmitter of wireless signals and one or more user devices act as the receiver of these wireless signals. For some other transmissions, as depicted in FIG. 3A, the direction of transmission may reverse. Such transmissions are often called uplink or upstream transmissions. For such transmissions, one or more user devices act as transmitters of the wireless signals and a network-side node such as the base station acts as the receiver of these signals (as depicted in FIG. 3A). Other type of transmissions in the network may include device-to-device transmissions, sometimes called direct or sideband transmissions. In frequency division multiplexing (FDM) networks (also called frequency division duplexing or FDD networks), the transmissions to a base station and the transmissions from the base station may occupy different frequency bands (each of which may occupy continuous or discontinuous spectrum). In time division multiplexing (TDM) networks (also called time division duplexing, or TDD, networks), the transmissions to a base station and the transmissions from the base station occupy a same frequency band, but are separated in time domain using a TDM mechanism such as time slot based transmissions. Other types of multiplexing are also possible (e.g., code division multiplexing, orthogonal time frequency space, or OTFS, multiplexing, spatial multiplexing, etc.). In general, the various multiplexing schemes can be combined with each other.

From the early days of single antenna systems in which the transmitting user device had a single transmission antenna and the receiving base station had a single receiving antenna for that signal, wireless systems have now evolved to configurations in which transmitters have multiple transmit antennas and receivers have multiple receive antennas. Such systems are often called multiple input multiple output (MIMO) systems. In a MIMO system, a wireless channel may therefore be representable as a matrix that acts on a vector representing the multiple inputs and produces the vector representing the multiple outputs. Depending on channel conditions, some entries of the channel matrix may change over time.

The wireless systems described in this document, subjected to some interference, are known to be able to achieve the channel capacity if the interference is known to the transmitter. By using a technique known as dirty paper coding (DPC), the transmitter can precode a transmission such that the signal arriving at the receiver is interference-free. In reality, a more implementation-friendly approximation of DPC known as Tomlinson-Harashima Precoding (THP) is likely to be used (and is discussed in a subsequent section of this document).

A precoded transmission is based on the knowledge of the exact channel response between the transmitting antenna(s) of a first terminal denoted by A—typically a base-station (BS)—to the receiving antenna(s) of a second terminal denoted by B—typically a piece of Consumer Premises Equipment (CPE) or a user equipment (UE). This channel response can be considered to be composed of three different parts as illustrated in FIG. 3B. First, the channel response of the transmitter in terminal A. Second, the channel response of the different reflectors. Third, the channel response of the receiver in terminal B. The transmitter channel responses may be due to the transmit chain circuitry such as power amplifiers, digital to analog converters (DACs), frequency upconverters and so on. The receiver channel response may be due to receiver-side circuitry such as low noise block (LNB), frequency downconverter, analog to digital conversion circuitry (ADC).

1.A. Second-Order Statistics

Without any loss of generality, let's consider a basic setup with a transmitter (e.g., a user device) using a single antenna and a receiver (e.g., a base station) with L antennas. If the transmitter (e.g., user device) has more than one antenna, then each antenna can be referred to as a separate transmitter.

Prior to the transmission of data, the system performs a preliminary training phase, where the second-order statistics of the channels between the transmitter and each one of the L receiver antennas are computed.

FIG. 3C shows an example of the basic setup in which the receiver comprises L receive antennas and the transmitter comprises a single transmit antenna. The signal transmitted from the transmitter is reflected (and dispersed) by a number of reflectors that give the wireless channel its characteristics. As further discussed in this document, the reflectors may be static or mobile, and have time-variant reflective characteristics.

In this initial phase, or training phase, the transmitter sends known reference signals, enabling the receiver to estimate the channel across all the bandwidth of interest and all the antennas. One example is in a multi-carrier scenario where the bandwidth of interest is represented with N_(f) discrete tones, at time instance k the receiver will estimate the channel response h_(k) as a complex column vector of size N=N_(f)·L. This step may be repeated N_(SOS) times and afterwards, the second-order statistics may be computed. Two different methods for this computation are proposed here as an example:

Direct method—In this method, the covariance matrix is calculated by arranging all channel responses as columns of the transfer matrix H and computing the cross correlation as: H=[h ₁ |h ₂ | . . . |h _(N) _(SOS) ]  (1) R _(HH) =H·H*  (2)

Average method—using this method, an average over N_(SOS) of the variance of each channel response are calculated.

$\begin{matrix} {R_{HH} = {\frac{1}{N_{SOS}}{\sum\limits_{k = 1}^{N_{SOS}}\;{h_{k} \cdot h_{k}^{*}}}}} & (3) \end{matrix}$

The covariance matrix R_(HH) is large with dimensions N×N. For example, in a 4 antenna system in which 8 tones are used for reference signal transmissions, N=32, and thus R_(HH) is a 32×32 matrix. However, the matrix encodes only a very small amount of information originating from the delay-Doppler profile and angle of arrival/departure of the reflectors of the wireless channel. These essential parameters of the channel can be extracted from the covariance matrix using a mathematical operation such as the Principal Component Analysis (PCA). For example, these parameters may be identified by computing the dominant eigenvalues and their corresponding eigenvectors of R_(HH). For extracting K dominant reflectors, R_(HH) may be approximated by R _(HH) ≈V·D·V*  (4)

where V is an N×K eigenvectors matrix and D is the corresponding K×K eignenvalues diagonal matrix.

1.B. Channel Estimation Using a Small Set of Resource Elements

Once the second-order statistics of the channels between the transmitter and the receivers' L antennas are computed, the transmitter (e.g., a single transmit antenna of a user device) may transmit only a very small set of known reference signals, from which the receiver will be able to estimate all the channels (to all the antennas and across all the bandwidth). The general rule of thumb is that the receiver will use at least K measurements to sense the parameters of the K dominant reflectors.

More formally, let

={m₁, m₂, . . . } be a set of frequency elements (tones), where m_(i) takes values in the range [1, 2, . . . , N_(f)]. Note that the size of

, denoted by |

|, depends on different parameters such as the number of antennas L, the number of reflectors K, their delay profile and their angle of arrival (AOA) to the receiver antennas. Typically, |

| is very small and in some cases, may even be equal one (a single tone).

The transmission of a small set of known reference signals over the tones of

is received over the L receiver's antennas. Let us define by M=|

|·L the number of received reference values, corresponding to this transmission. Using the second-order statistics, an interpolation MMSE filter, C, can be computed from these M received elements to estimate the channel over all the N elements. Let H_(M) be the channel response over these M received elements. Then, C may be computed as C=R _(HH) _(M) ·(R _(H) _(M) _(H) _(M) )⁻¹  (5)

where R_(HH) _(M) and R_(H) _(M) _(H) _(M) corresponds to decimated versions of the full R_(HH) matrix (one or two of the dimensions is reduced to M).

The PCA approximation for the second-order statistics can be useful to reduce the complexity of such a computation. Let V_(M) be the matrix V decimated along its N dimension to M. Then, C can be expressed as C=V·D·V _(M)*·(V _(M) ·D·V _(M))⁻¹ =V·(V _(M))⁻¹  (6)

The last computation requires inverting V_(M), which has the dimensions of M×K. However, by algebraic manipulation, the inverted matrix may be even further reduced to a size of K×K C=V·(V _(M) *·V _(M))⁻¹ ·V _(M)*  (7)

Finally, the full channel response is obtained by computing H=C·H _(M)  (8)

1.C. Estimating the Sufficient Number of Resource Elements

The receiver may use different methods, to estimate the required number of (time-frequency) resource elements in

, to provide a sufficient quality of channel estimation. One method to do this, is to compute the error covariance matrix R _(E) =V·D·V*−C·V _(M) ·D·V*=(V−C·V _(M))·D·V*  (9)

and use it to compare the mean energy along the diagonal to a threshold

$\begin{matrix} {d_{R_{E}} = {{diag}\left( R_{E} \right)}} & (10) \\ {\overset{\_}{R_{E}}\overset{\Delta}{=}{{\frac{1}{N}{\sum\limits_{i = 1}^{N}\;{{d_{R_{E}}(i)}}^{2}}} < {TH}}} & (11) \end{matrix}$

This criterion may be used to determine whether the number of elements in

is sufficient. Afterwards, the receiver may instruct the transmitter to adjust the number of required reference signals to transmit.

To illustrate this concept, an extreme case of channels with many reflectors and small angle-of-arrivals was examined with different number of tones allocated for reference signals. White Gaussian noise was added to the received signal, creating a signal-to-noise (SNR) ratio of 60 dB. The graph in FIG. 4, shows for a varying number of tones with reference signals (1 to 5), the computed values of the average error covariance and the average estimation SNR (inverse of mean-square-error compared to the true channel). The computed average error covariance, R_(E) , can be roughly compared to a threshold of 235 dB, afterwards the noise contribution of the estimated channel is smaller than that of the AWGN. Therefore, for this example, it would be recommended to use 5 tones with reference signals.

1.D. Embodiments for Prediction in FDD/TDD Networks

The methods described in the previous sections may also be applied directly for efficient channel prediction. Channel prediction may include a training phase, where reference signals are transmitted over two different time-frequency resources sets and the second-order statistics is computed for the corresponding channels. These sets may include two non-overlapping frequency bands, two different time instances, or a combination of both. For example, in FDD networks, downlink and uplink transmissions use different frequency bands, and channel characteristics over one of downlink/uplink channel could be predicted based on observed channel estimates over the other (uplink or downlink) channel.

Let h_(k,1) represent a column vector of the channel response over N_(f1) frequency tones and L antennas, across a first frequency band and at time instance T_(k) (first set) and h_(k,2) as a column vector of the channel response over N_(f2) frequency tones and L antennas, across a second frequency band and at time instance T_(k)+Δ (second set). A matrix H can be formulated as the concatenation of these column vectors from multiple training sessions and compute the covariance matrix R_(HH).

$\begin{matrix} {H = \left\lbrack {\begin{matrix} h_{1,1} \\ h_{2,1} \end{matrix}{{\begin{matrix} h_{2,1} \\ h_{2,2} \end{matrix}{{\ldots\left. \begin{matrix} h_{N_{SOS},1} \\ h_{N_{SOS},2} \end{matrix} \right\rbrack}}}}} \right.} & (12) \end{matrix}$ R _(HH) =H·H*  (13)

The procedure described in previous sections, may be fully applied here as well. PCA may be applied to R_(HH) for K dominant reflectors. In the operational phase, the transmitter may send a small set of reference signals, m, over part of the first time-frequency set and use the computed interpolation filter C=R _(HH) _(M) ·(R _(H) _(M) _(H) _(M) )⁻¹  (14) H=C·H _(M)  (15)

to estimate the channel across the entire second time-frequency set.

For example, after a training session, multiple user devices are transmitting their small set of resources to the base station, where it is used for predicting future channels in a different band (FDD) or in the same band (TDD). The base station uses the predicted channels to compute a precoded transmission back to the users.

This method may also be applied for non-direct prediction techniques. For example, as a first step, the second-order statistics of the channel may be computed from full-band reference signals. Then, small sets of reference signals at both time-frequency sets are transmitted. The received signals in each set, consisting of M elements may be further compressed to K elements by computing H _(K)=(V _(M))⁻¹ ·H _(M)  (16)

Then, the covariance matrices of the two sets and the cross-covariance matrix may be computed along with an interpolation filter from one set to the other R ⁽¹⁾ =H _(K) ⁽¹⁾·(H _(K) ⁽¹⁾)*  (17) R ^((2,1)) =H _(K) ⁽²⁾·(H _(K) ⁽¹⁾)*  (18) C ^((2,1)) =R ^((2,1))·(R ⁽¹⁾)⁻¹  (19)

Finally, the channel in the second set is predicted from the channel in the first set H _(K) ⁽²⁾ =C ^((2,1)) ·H _(K) ⁽¹⁾  (20) and computed over all the N elements H=V·H _(K) ⁽²⁾  (21)

1.E. Channel Responses and Channel Reciprocity

There are two main differences between the channel responses at terminals A and B and the channel response of the wireless channel reflectors:

1. The channel response of the wireless channel reflectors in a time-division duplex (TDD) system is reciprocal whereas the channel response of the terminals is not.

2. The channel response of the wireless channel reflectors may change rapidly (e.g., in 1-10 milliseconds, depending on the Doppler of the reflectors and terminals), but the channel response of the terminals changes slowly, mostly with temperature.

There are several methods for obtaining the complete channel response from terminal A to B described in the literature. For example, an explicit method would be to send known reference signals from terminal A to B and have terminal B transmit back the values of the received reference signals to terminal A. This is often referred to as explicit feedback. However, each value must be represented with multiple bits, and in a system where terminal A has many antennas, there are many user terminals and significant Doppler effects causing the propagation channel to change rapidly, the amount of information that needs to be transmitted can severely reduce the overall system efficiency. In the extreme case with high levels of Doppler, it is simply not possible to feedback all the required Channel State Information (CSI) quickly enough, resulting in stale CSI and suboptimal precoding.

Instead, a TDD system can use an approach known as “reciprocity calibration” to obtain the relationship between the non-reciprocal parts of the channel response in both transmission directions: the AB (from A to B) and the BA (from B to A). Terminal B first transmits known reference signals that allow terminal A to compute the AB channel response. Using knowledge of the non-reciprocal relationship, terminal A can adjust the BA channel response to make it suitable for precoding a transmission back to terminal B.

More formally, for a multi-carrier TDD system that uses multi-carrier modulation, where the channel can be described as a complex value in the frequency domain for a specific sub-carrier (tone), the three components of the AB channel response can be denoted as H_(A) ^(TX), H^(CH) and H_(B) ^(RX). Similarly, the three components of the BA channel response are H_(B) ^(TX), H^(CH) and H_(A) ^(RX). The overall downlink (AB) channel response is H _(AB) =H _(A) ^(TX) ·H ^(CH) ·H _(B) ^(RX)  (22)

and the overall uplink (BA) channel response is H _(BA) =H _(B) ^(TX) ·H ^(CH) ·H _(A) ^(RX)  (23)

From H_(AB) and H_(BA), the reciprocity calibration factor can be written as

$\begin{matrix} {\alpha = \frac{H_{A}^{TX} \cdot H_{B}^{TX}}{H_{B}^{TX} \cdot H_{A}^{RX}}} & (24) \end{matrix}$

Therefore, if H_(BA) is known at terminal A, it can compute H_(AB)=αH_(BA). The question that remains is how to obtain α. Note that for the multi-carrier system, the above Equations (22) to (24) will provide reciprocity calibration values and channel responses on a per sub-carrier basis for sub-carriers on which reference signals are transmitted.

Different methods exist within the literature for computing the reciprocity calibration factor. The most straight forward of these is to utilize explicit feedback as described above, but only feed back H_(AB) when α is re-calculated. Since the transmitter and receiver channel responses change relatively slowly, the rate of feedback is typically in the order of minutes and thus represents negligible overhead for a modest number of terminals and antennas. However, when the number of antennas in terminal A and the number of CPEs (terminal B) is large, as can be the case in a massive multiple-input multiple-output (MIMO) system with many subscribers, the feedback overhead can consume a considerable portion of the system capacity.

Another approach is to have terminal A transmit reference signals between its own antennas and calculate calibration factors for only H_(A) ^(TX) and H_(A) ^(RX). That is, obtain:

$\begin{matrix} {\alpha_{A} = \frac{H_{A}^{TX}}{H_{A}^{RX}}} & (25) \end{matrix}$ which results in {tilde over (H)} _(AB)=α_(A) ·H _(BA) =H _(A) ^(TX) ·H _(B) ^(TX) ·H ^(CH)  (26)

Terminal A will then precode one reference symbol using {tilde over (H)}_(AB) that terminal B can use to remove its H_(B) ^(TX) and H_(B) ^(RX) contributions from all subsequent precoded transmissions. This technique may be called relative calibration. Whilst this approach entirely removes the need for feedback of H_(BA), the need for terminal A to transmit to itself during a calibration procedure and then to CPEs that could be located many hundreds of meters or even kilometers away can create dynamic range challenges. It is typically desirable to use the same hardware gain stages in the transmit chain when calibrating as those used for transmission, since having to switch gain stages between calibration and transmission can change the nature of H_(A) ^(TX) and H_(A) ^(RX).

This document describes, amongst other embodiments and approaches, a new approach for computing the reciprocity calibration factor that avoids the dynamic range concern of relative calibration whilst maintaining high levels of efficiency when scaling to a larger number of antennas and terminals. As described herein, the reference signals transmitted for calibration and at the same power level as typical signal transmissions, and hence are better suited to capture and calibrate the distortions introduced by transmit/receive circuitry.

1.F. Reciprocity Calibration Via Receiver-Side Inversion

Let Terminal A transmit known reference signals over a subset of multi-carrier tones and P be a specific reference signal at one of these tones. For example, Terminal A may use every Mth subcarrier for reference signal transmission, where M is an integer. For example, M may be 8 or 16 in practical systems. Terminal B receives Y _(B) =H _(AB) ·P+W  (27) where W is additive white Gaussian noise with zero mean and variance N₀. Note that the above equation is a scalar equation because the equation represents the received signal at a single subcarrier. For each subcarrier on which a reference is transmitted, there will be one such equation. Terminal B estimates H_(AB) from Y_(B) and inverts it. To avoid singularities and cope with a large dynamic range, regularized zero forcing may be used to compute the inversion:

$\begin{matrix} {{\overset{\sim}{H}}_{AB}^{- 1} = {\frac{H_{AB}^{*}}{{H_{AB}^{*} \cdot H_{AB}} + N_{0}} \approx H_{AB}^{- 1}}} & (28) \end{matrix}$

Terminal B then transmits {tilde over (H)}_(AB) ⁻¹ back to terminal A over the same tone. This transmission should quickly follow the first one—especially in the presence of Doppler—to ensure H^(CH) remains relatively constant. Terminal A then receives Y _(B) =H _(BA) ·{tilde over (H)} _(AB) ⁻¹ +W  (29)

Ignoring the noise term, which may be averaged out over multiple transmissions, it can be seen that Y_(B) is the inverse of the reciprocity calibration factor:

$\begin{matrix} {{Y_{B} \approx \frac{H_{B}^{TX} \cdot H^{CH} \cdot H_{A}^{RX}}{H_{A}^{TX} \cdot H^{CH} \cdot H_{B}^{RX}}} = {\frac{H_{B}^{TX} \cdot H_{A}^{RX}}{H_{A}^{TX} \cdot H_{B}^{RX}} = \alpha^{- 1}}} & (30) \end{matrix}$

Since these are scalar values, the inversion processing is for both H_(AB) and Y_(B) is straightforward. Here, the inverse reciprocity calibration factor represents a ratio of circuitry channel from Terminal B to Terminal A, and a circuitry channel from Terminal A to Terminal B.

In multi-carrier systems, the above-described procedure may be repeated over multiple tones and the result interpolated to yield the full set of calibration factors over the bandwidth of interest. This full set may be obtained, for example, by averaging or interpolating the calibration factors are the subcarriers at which reference signals were transmitted. Since the Tx and Rx contributions of both terminal A and B will be relatively flat across frequency, it should be possible to use a sparse subgrid of tones with the appropriate interpolation to obtain an accurate level of calibration.

The results of the channel estimation as above may be combined with channel estimation of the H^(CH) channel to obtain an estimate of the overall channel H_(AB) and H_(BA).

2. Wireless Precoded Communication for FDD Systems

A wireless system, with a multi-antenna base-station and multiple user antennas, is shown in FIG. 5. Each transmission from a user antenna to one of the base-station antennas (or vice versa), experiences a different channel response (assuming the antennas are physically separated enough). For efficient communication, the base-station improves the users' received Signal-to-Interference-Noise-Ratio (SINR) by means of precoding. However, to precode, the base-station needs to have an accurate estimation of the downlink channels to the users during the transmission time.

In FDD systems, two directions of transmissions may use two different (typically non-overlapping) frequency bands. These transmissions may include, for example, transmissions from a network-side node such as a base station or an access point to multiple user devices, often called the downlink direction, and transmissions from the multiple user devices to the network-side node, often called the upstream or uplink direction. The various embodiments described in the present document, and the attached appendices, perform signal processing to improve communication by, for example, estimating second order statistics of a wireless channel and using the estimate to perform pre-coding in an FDD system.

In the following subsections, an efficient system and a method for predicting the downlink channel for precoding in an FDD system is described.

2.A. Second-Order Statistics Training

For simplicity, this section focuses on a single user antenna and the L base-station antennas. This can be easily extended to any number of users. The setup of the system is shown in FIG. 6. The base-station predicts from the uplink channel response, the downlink channel response in a different frequency band and N_(latency) subframes later.

To achieve this, the system preforms a preliminary training phase, consisting of multiple sessions, where in each session i=1, 2, . . . , N_(training), the following steps are taken:

-   -   At subframe n, the user equipment transmits reference signals         (RS) in the uplink. The base-station receives them and estimate         the uplink channel H_(UL) ^((i)) over the L base-station         antennas.     -   At subframe n+N_(latency), the base-station transmits reference         signals in the downlink from all its antennas. The user         equipment receives it and sends it back as uplink data in a         later subframe. The base-station computes the downlink channel         estimation for it, H_(DL) ^((i)). In a different implementation,         it is possible that the UE will compute the channel estimation         and send it to the base-station as uplink data.     -   The base-station computes the second-order statistics         R _(UL) ^((i)) =H _(UL) ^((i))·(H _(UL) ^((i)))^(H)         R _(DL,UL) ^((i)) =H _(DL) ^((i))·(H _(UL) ^((i)))^(H)         R _(DL) ^((i)) =H _(DL) ^((i))·(H _(DL) ^((i)))^(H)

Herein, (⋅)^(H) is the Hermitian operator. For the case that the channel has non-zero-mean, both the mean and the covariance matrix should be determined.

When the training sessions are completed, the base-station averages out the second order statistics:

$R_{UL} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{UL}^{(i)}}}$ $R_{{DL},{UL}} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{{DL},{UL}}^{(i)}}}$ $R_{DL} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{DL}^{(i)}}}$

Then, it computes the prediction filter and the covariance of the estimation error: C _(prediction) =R _(DL,UL)·(R _(UL))⁻¹ R _(E) =R _(DL) −C _(prediction)·(R _(DL,UL))^(H)

The inversion of R_(UL) may be approximated using principal component analysis techniques. We compute {λ}, the K most dominant eigenvalues of R_(UL), arranged in a diagonal matrix D=diag(λ₁, λ₂, . . . , λ_(K)) and their corresponding eigenvectors matrix V. Typically, K will be in the order of the number of reflectors along the wireless path. The covariance matrix can then be approximated by R_(UL)≈V·D·(V)^(H) and the inverse as R_(UL)≈V·D⁻¹·(V)^(H).

Note, that there is a limited number of training sessions and that they may be done at a very low rate (such as one every second) and therefore will not overload the system too much.

To accommodate for possible future changes in the channel response, the second-order statistics may be updated later, after the training phase is completed. It may be recomputed from scratch by initializing again new N_(training) sessions, or by gradually updating the existing statistics.

The interval at which the training step is to be repeated depends on the stationarity time of the channel, i.e., the time during which the second-order statistics stay approximately constant. This time can be chosen either to be a system-determined constant, or can be adapted to the environment. Either the base-station or the users can detect changes in the second-order statistics of the channel and initiate a new training phase. In another embodiment, the base-station may use the frequency of retransmission requests from the users to detect changes in the channel, and restart the process of computing the second-order statistics of the channel.

2.B. Scheduling a Downlink Precoded Transmission

For each subframe with a precoded downlink transmission, the base-station should schedule all the users of that transmission to send uplink reference signals N_(latency) subframes before. The base-station will estimate the uplink channel responses and use it to predict the desired downlink channel responses H _(DL) =C _(prediction) ·H _(UL)

Then, the downlink channel response H_(DL) and the prediction error covariance R_(E) will be used for the computation of the precoder.

3. Efficient Channel Estimation Using Second-Order Statistics

In some embodiments, channel knowledge is typically acquired by transmitting known reference signals (pilots) and interpolating them at the receiver over the entire bandwidth and time of interest. Typically, the density of the pilots depends on characteristics of the channel. Higher delay spreads require more dense pilots along frequency and higher Doppler spreads require more dense pilots along time. However, the pilots are typically required to cover the entire bandwidth of interest and, in some cases, also the entire time interval of interest.

Herein, a method based on the computation of the second-order statistics of the channel, where after a training phase, the channel can be estimated over a large bandwidth from reference signals in a much smaller bandwidth is proposed. Even more, the channel can also be predicted over a future time interval.

3.A. Second-Order Statistics Training for Channel Estimation

Similar to the embodiments described in Section 2.A, a system preforms a preliminary training phase, consisting of multiple sessions, where in each session i=1, 2, . . . , N_(training), the following steps are taken:

-   -   The transmitter sends reference signals to the receiver. We         partition the entire bandwidth of interest into two parts BW₁         and BW₂, as shown in FIG. 7, where typically the size of BW₁         will be smaller or equal to BW₂. Note, that these two parts do         not have to from a continuous bandwidth. The transmitter may         send reference signals at both parts at the same time interval         (FIG. 8) or at different time intervals (FIG. 9).     -   The receiver receives the reference signals and estimates the         channel over their associated bandwidth, resulting in channel         responses H₁ ^((i)) and H₂ ^((i)).     -   The receiver computes the second-order statistics of these two         parts:         R ₁ ^((i)) =H ₁ ^((i))·(H ₁ ^((i)))^(H)         R _(2,1) ^((i)) =H ₂ ^((i))·(H ₁ ^((i)))^(H)         R ₂ ^((i)) =H ₂ ^((i))·(H ₂ ^((i)))^(H)

Herein, (⋅)^(H) is the Hermitian operator. For the case that the channel has non-zero-mean, both the mean and the covariance matrix should be determined, as is further discussed in the attached appendices. When the training sessions are completed, the base-station averages out the second order statistics:

$R_{1} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{1}^{(i)}}}$ $R_{2,1} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{2,1}^{(i)}}}$ $R_{2} = {\frac{1}{N_{training}}{\sum\limits_{i = 1}^{N_{training}}\; R_{2}^{(i)}}}$

Then, the receiver computes a prediction filter: C _(prediction) =R _(2,1)·(R ₁)⁻¹

and if needed, also the covariance of the estimation error R _(E) =R ₂ −C _(prediction)·(R _(2,1))^(H)

The inversion of R₁ may be approximated using principal component analysis techniques. We compute {λ}, the K most dominant eigenvalues of R₁, arranged in a diagonal matrix D=diag(λ₁, λ₂, . . . , λ_(K)) and their corresponding eigenvectors matrix V. Typically, K will be in the order of the number of reflectors along the wireless path. The covariance matrix can then be approximated by R₁≈V·D·(V)^(H) and the inverse as R₁ ⁻¹≈V·D⁻¹·(V)^(H).

Note, that there is a limited number of training sessions and that they may be done at a very low rate (such as one every second) and therefore will not overload the system too much.

To accommodate for possible future changes in the channel response, the second-order statistics may be updated later, after the training phase is completed. It may be recomputed from scratch by initializing again new N_(training) sessions, or by gradually updating the existing statistics.

The interval at which the training step is to be repeated depends on the stationarity time of the channel, i.e., the time during which the second-order statistics stay approximately constant. This time can be chosen either to be a system-determined constant, or can be adapted to the environment. Either the base-station or the users can detect changes in the second-order statistics of the channel and initiate a new training phase. In another embodiment, the base-station may use the frequency of retransmission requests from the users to detect changes in the channel, and restart the process of computing the second-order statistics of the channel.

3.B. Embodiments for Efficient Channel Estimation

After the training phase is completed, the transmitter may only send reference signals corresponding to BW₁. The receiver, estimated the channel response H₁ and use it to compute (and predict) and channel response H₂ over BW₂ using the prediction filter: H ₂ =C _(prediction) ·H ₁

FIGS. 10 and 11 describe example two prediction scenarios (same time interval and future time interval, respectively).

4. Reciprocal Calibration for Reverse Channel Estimation

In the operation of the wireless systems described in this document, n−1 signals, intended for n−1 individual UEs, will act as interference for the target UE. A transmit pre-coder cancels the interference generated at the target UE by the n−1 un-intended signals meant for other UEs. To build a pre-coder, down link channel state information (CSI) is used.

In an extrinsic beamforming technique, CSI is fed back from the UE to BS through a feedback up-link channel. However, considerable amount of data BW is used for this, thus affecting the overall system throughput efficiency.

For Time Division Duplex (TDD) systems, the physical channel in the air (sometimes called the radio channel) is reciprocal within the channel coherence time. i.e., the up-link (UE to BS) and down-link (BS to UE) are identical (in SISO (transpose in MIMO). However, when the transceiver front-end (FE) hardware is also taken into account, channel reciprocity no longer holds. This is due to the non-symmetric characteristics of the RF hardware. It includes PA non-linearity, RF chain crosstalk, phase noise, LNA non-linearity and noise figure, carrier and clock drifts etc.

In some embodiments, a calibration mechanism can be designed to calibrate for the nonreciprocal components of the wireless link such that embodiments can estimate the down link by observing the up-link with the help of these calibration coefficients. If this is feasible, no CSI feedback is necessary (as in the case of extrinsic beam forming), thus improving the overall system throughput efficiency. The associated beamforming is also sometimes called intrinsic beamforming.

FIG. 12 shows an example block diagram of a communication channel with reciprocity. The composite wireless channel from A to B may be represented as: Ĥ_(A,B)=C_(RX,B)·H_(A,B)·C_(TX,A). For the reciprocal channel, it may be assumed that H_(AB)=λH_(BA) ^(T) for a complex scalar (λ).

In the case of a non-reciprocal channel, with analog and RF components, Non-reciprocal analog and RF components: C_(TX, A), C_(RX, A), C_(RX, B), C_(TX, B), ideally for simplicity, it is beneficial if each matrix is a diagonal matrix. Such an embodiment may also use a design that minimizes the coupling between Tx and Rx paths. Similarly, the composite channel from B to A is given by Ĥ_(B,A)=C_(RX, A)·H_(B,A)·C_(TX,B).

If all the C matrices can be estimated a priori, the BS to UE channel can be estimated from the UE to BS channel. In such a case, feeding back channel state information for transmit beamforming may not be needed, thereby making the upstream bandwidth available for data instead of having to transmit channel state information. Estimation of the C matrices may also improve system efficiency. In some embodiments disclosed herein, the reciprocity calibration may be performed by calibrating Tx and Rx of the BS and UE side during a startup or a pre-designated time. The diagonal matrices C_(TX, A), C_(RX, A), C_(RX, B), C_(TX, B) may be estimated. These matrices may be re-estimated and updated periodically. The rate of change of the C matrices will typically be slow and may be related to factors such as the operating temperature of the electronics used for Tx and Rx.

4.A. Notation

In the description herein, h_(a1a2) denotes the channel from transmitter (TX) a1 to receiver (RX) a2. This notation is different from the conventional MIMO channel notation. In the conventional methods, this will be denoted as h_(a2a1))·Also, conjugate of a complex quantity is represented with a*, e.g., conj(h)=h*.

4.B. Downlink Channel Estimation from Uplink Channel and Calibration Coefficients

While the disclosed techniques are more generally applicable, for the ease of explanation, the following assumptions are made:

[1] cross talk between the TX-TX, RX-RX and TX-RX RF chains is negligible

[2] Antenna mutual coupling in negligible

[3] TX and RX at BS are working with clocks generated from the same PLL so that carrier and symbol clocks are synchronized in wireless transmissions among transceivers at A or B (and not necessarily between A and B). Here, “A” and “B” represent communication devices at two ends of a communication medium. For example, A may refer to a base station (or user equipment) and correspondingly B may refer to a user equipment (or base station). As another example, A may refer to a hub and B may refer to a remote station. Without loss of generality, the channel from A to B may be called the downlink (DL) channel and the channel from B to A may be called the uplink (UL) channel. See, e.g., FIG. 13 and FIG. 14.

[4] same assumptions as above for UE.

Inventors' measurement on some existing equipment has verified that a) the coupling between different RF paths is typically of the order of −30 dB. A careful design of the RF front end can ensure even lesser levels of cross talk. b) The isolation between the cross polarizations of the antenna is of the order of 15 to 20 dB. This means that if a signal of xdB power is sent on the vertical polarization of a cross polarized antenna, an image with (x−15) dB power will appear on the horizontal polarization. This isolation cannot be improved much even under improved antenna design. So, for the below calibration mechanism to work properly, embodiments should either use i) antenna with single polarization is used or ii) if dual polarized antenna are used, take care that simultaneous transmission on both the polarizations is never happening.

However, these assumptions can be relaxed, as described herein, and modifications in the below described calibration algorithm will be presented as well. If dual polarized antenna is the design choice, modifications to the disclosed algorithm as described herein could be used in some embodiments.

Some embodiments of a calibration algorithm are described herein for a 4×4 MIMO system. This is to keep the description simple and easy to comprehend. The same mechanism can be generalized to systems with any number of BS and UE antenna.

With reference to FIG. 13 and FIG. 14, a four antenna system 1300 at A and a four antenna system 1400 at B are depicted, respectively. For example, the configuration 1300 at A may represent a base station and the configuration 1400 at B may represent a UE (or vice versa). Let halal denote the channel from TX a1 to RX a2. It is constituted by 2 components a). The reciprocal radio channel from antenna a1 to antenna a2 and b) the non-reciprocal components at TX a1 and RX a2. Non-reciprocal components are captured in two memory-less complex scalars denoted by t_(a1) and r_(a2) corresponding to the TX and RX respectively. In this patent document, modifications when delay is involved will be demonstrated as well.

Thus, ĥ_(a1a2) can be written as: ĥ _(a1a2) =t _(a1) ·h _(a1a2) ·r _(a2)  (31)

Similarly, channel between TX at a2 to RX at a1, ĥ_(a2a1), can be written as ĥ _(a2a1) =t _(a2) ·h _(a2a1) ·r _(a1)  (32)

Taking the ratio between ĥ_(a1a2) and ĥ_(a2a1), and noting that ha1 a2 and ha2a1 are identical, the following can be written:

$\begin{matrix} \begin{matrix} {c_{a\; 1a\; 2} = \frac{t_{a\; 1} \cdot r_{a\; 2}}{r_{a\; 1} \cdot t_{a\; 2}}} \\ {= {\frac{1}{c_{a\; 2a\; 1}}.}} \end{matrix} & (33) \end{matrix}$

The coefficient c_(a1a2) is referred to as the calibration coefficient from a1 to a2. Similarly, the calibration coefficient from a2 to a3, c_(a2a3), can be written as:

$\begin{matrix} \begin{matrix} {c_{a\; 2a\; 3} = \frac{t_{a\; 2} \cdot r_{a\; 3}}{r_{a\; 2} \cdot t_{a\; 3}}} \\ {= {\frac{t_{a\; 1} \cdot r_{a\; 3}}{r_{a\; 1} \cdot t_{a\; 3}} \cdot \frac{r_{a\; 1} \cdot t_{a\; 2}}{t_{a\; 1} \cdot r_{a\; 2}}}} \\ {= \frac{c_{a\; 1a\; 3}}{c_{a\; 1a\; 2}}} \end{matrix} & (34) \end{matrix}$

From Eq. (34), it can be seen that the calibration coefficient between antenna a2 (TX) and antenna a3 (RX) can be written as the ratio of the calibration coefficients of the reference antenna a1 to that of a3 and a2. Similar relations can be derived for TXs and RXs at B, depicted in configuration 1400 of FIG. 14. Equations for calibration coefficients that involve antennas from both sides A and B can be derived as below.

$\begin{matrix} \begin{matrix} {c_{a\; 2b\; 2} = \frac{t_{a\; 2} \cdot r_{b\; 2}}{t_{b\; 2} \cdot r_{a\; 2}}} \\ {= {\frac{t_{a\; 1} \cdot r_{b\; 1}}{t_{b\; 1} \cdot r_{a\; 1}} \cdot \frac{r_{a\; 1} \cdot t_{a\; 2}}{t_{a\; 1} \cdot r_{a\; 2}} \cdot \frac{t_{b\; 1} \cdot r_{b\; 2}}{t_{b\; 2} \cdot r_{b\; 1}}}} \\ {= {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}} \cdot c_{b\; 1b\; 2}}} \end{matrix} & (35) \end{matrix}$

From Eq. (35), it should be clear that any wireless channel between A and B can be written in terms of a) a calibration coefficient with respect to a reference antenna at A, b) a calibration coefficient with respect to a reference antenna at B, and c) a calibration coefficient between the same reference antennas at A and B.

Similarly, the downstream channels (BS-UE) can be represented in terms of the upstream channels (UE-BS) and calibration coefficients. ĥ _(a1b1) =c _(a1b1) ·ĥ _(b1a1) ĥ _(a1b2) =c _(a1b1) ·c _(b1b2) ·ĥ _(b2a1) (c _(a1b2) ·ĥ _(b2a1)) ĥ _(a1b3) =c _(a1b1) ·c _(b1b3) ·ĥ _(b3a1) (c _(a1b3) ·ĥ _(b3a1)) ĥ _(a1b4) =c _(a1b1) ·c _(b1b4) ·ĥ _(b4a1)  (36)

Similarly,

$\begin{matrix} {{{\hat{h}}_{a\; 2b\; 1} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}} \cdot {\hat{h}}_{b\; 1a\; 2}}}{{\hat{h}}_{a\; 2b\; 2} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}} \cdot c_{b\; 1b\; 2} \cdot {\hat{h}}_{b\; 2a\; 2}}}{{\hat{h}}_{a\; 2b\; 3} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}} \cdot c_{b\; 1b\; 3} \cdot {\hat{h}}_{b\; 3a\; 2}}}{{\hat{h}}_{a\; 2b\; 4} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}} \cdot c_{b\; 1b\; 4} \cdot {{\hat{h}}_{b\; 4a\; 2}.}}}} & (37) \end{matrix}$

Furthermore

$\begin{matrix} {{{\hat{h}}_{a\; 3b\; 1} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 3}} \cdot {\hat{h}}_{b\; 1a\; 3}}}{{\hat{h}}_{a\; 3b\; 2} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 3}} \cdot c_{b\; 1b\; 2} \cdot {\hat{h}}_{b\; 2a\; 3}}}{{\hat{h}}_{a\; 3b\; 3} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 3}} \cdot c_{b\; 1b\; 3} \cdot {\hat{h}}_{b\; 3a\; 3}}}{{{\hat{h}}_{a\; 3b\; 4} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 3}} \cdot c_{b\; 1b\; 4} \cdot {\hat{h}}_{b\; 4a\; 3}}},}} & (38) \end{matrix}$

And finally

$\begin{matrix} {{{\hat{h}}_{a\; 4b\; 1} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 4}} \cdot {\hat{h}}_{b\; 1a\; 4}}}{{\hat{h}}_{a\; 4b\; 2} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 4}} \cdot c_{b\; 1b\; 2} \cdot {\hat{h}}_{b\; 2a\; 4}}}{{\hat{h}}_{a\; 4b\; 3} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 4}} \cdot c_{b\; 1b\; 3} \cdot {\hat{h}}_{b\; 3a\; 4}}}{{\hat{h}}_{a\; 4b\; 4} = {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 4}} \cdot c_{b\; 1b\; 4} \cdot {\hat{h}}_{b\; 4a\; 4}}}} & (39) \end{matrix}$

Using the results from Eq. (36) to Eq. (39), and denoting c_(a1b1) as ζ, a complex constant, the downlink MIMO channel can be expressed in terms of the uplink MIMO channel using the following equation:

$\begin{matrix} {\begin{bmatrix} {\hat{h}}_{a\; 1b\; 1} & {\hat{h}}_{a\; 2b\; 1} & {\hat{h}}_{a\; 3b\; 1} & {\hat{h}}_{a\; 4b\; 1} \\ {\hat{h}}_{a\; 1b\; 2} & {\hat{h}}_{a\; 2b\; 2} & {\hat{h}}_{a\; 3b\; 2} & {\hat{h}}_{a\; 4b\; 2} \\ {\hat{h}}_{a\; 1b\; 3} & {\hat{h}}_{a\; 2b\; 3} & {\hat{h}}_{a\; 3b\; 3} & {\hat{h}}_{a\; 4b\; 3} \\ {\hat{h}}_{a\; 1b\; 4} & {\hat{h}}_{a\; 2b\; 4} & {\hat{h}}_{a\; 3b\; 4} & {\hat{h}}_{a\; 4b\; 4} \end{bmatrix} = {\zeta \cdot \begin{bmatrix} {\hat{h}}_{a\; 1b\; 1} & {\frac{1}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 1a\; 2}} & {\frac{1}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 1a\; 3}} & {\frac{1}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 1a\; 4}} \\ {c_{b\; 1b\; 2}{\hat{h}}_{b\; 2a\; 1}} & {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 2a\; 2}} & {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 2a\; 3}} & {\frac{c_{a\; 1b\; 1}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 2a\; 4}} \\ {c_{b\; 1b\; 3}{\hat{h}}_{b\; 3a\; 1}} & {\frac{c_{a\; 1b\; 3}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 3a\; 2}} & {\frac{c_{a\; 1b\; 3}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 3a\; 3}} & {\frac{c_{a\; 1b\; 3}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 3a\; 4}} \\ {c_{b\; 1b\; 4}{\hat{h}}_{b\; 4a\; 1}} & {\frac{c_{a\; 1b\; 4}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 4a\; 2}} & {\frac{c_{a\; 1b\; 4}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 4a\; 3}} & {\frac{c_{a\; 1b\; 4}}{c_{a\; 1a\; 2}}{\hat{h}}_{b\; 4a\; 4}} \end{bmatrix}}} & \left( {40a} \right) \end{matrix}$

The right hand side of Eq. (40a) can be further decomposed as:

$\begin{matrix} {= {\zeta \cdot \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & c_{b\; 1b\; 2} & 0 & 0 \\ 0 & 0 & c_{b\; 1b\; 3} & 0 \\ 0 & 0 & 0 & c_{b\; 1b\; 4} \end{bmatrix} \cdot {\quad{\begin{bmatrix} {\hat{h}}_{a\; 1b\; 1} & {\hat{h}}_{a\; 1b\; 2} & {\hat{h}}_{a\; 1b\; 3} & {\hat{h}}_{a\; 1b\; 4} \\ {\hat{h}}_{a\; 2b\; 1} & {\hat{h}}_{a\; 2b\; 2} & {\hat{h}}_{a\; 2b\; 3} & {\hat{h}}_{a\; 2b\; 4} \\ {\hat{h}}_{a\; 3b\; 1} & {\hat{h}}_{a\; 3b\; 2} & {\hat{h}}_{a\; 3b\; 3} & {\hat{h}}_{a\; 3b\; 4} \\ {\hat{h}}_{a\; 4b\; 1} & {\hat{h}}_{a\; 4b\; 2} & {\hat{h}}_{a\; 4b\; 3} & {\hat{h}}_{a\; 4b\; 4} \end{bmatrix} \cdot \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & \frac{1}{c_{a\; 1a\; 2}} & 0 & 0 \\ 0 & 0 & \frac{1}{c_{a\; 1a\; 3}} & 0 \\ 0 & 0 & 0 & \frac{1}{c_{a\; 1a\; 3}} \end{bmatrix}}}}} & \left( {40b} \right) \end{matrix}$

Eq. (40b) is of the form ζ·K_(B)·H_(U)·K_(A). Elements in the calibration coefficient matrix K_(A) and K_(B) are obtained by calibrations performed at A (BS) and B (UE) and later by transferring UE coefficients to the BS. Note that calibration coefficient estimation at the BS may involve transmission and reception of calibration signals among BS antennas (a.k.a. local calibration). Similarly, estimation of calibration coefficients at UE can be performed using local transmission and reception of calibration signals among UE antennas.

In some embodiments, the TX and RX timing at a device (BS or UE) may be operated from the same PLL. This eliminates the carrier and/or clock offset impairments that is often associated with the detector at B for RF transmissions from A and vice versa. This is because A and B will be deriving all their internal clock frequencies, in general, from 2 different PLLs, one at A and another one at B. If these impairments are a part of the calibration coefficients, e.g., manifest themselves as a time varying phase rotation, then the coefficients will vary more frequently due to time varying carrier or clock errors in addition to its own time variability. Since K_(A) and K_(B) are obtained from measurements exclusively at BS or UE (and not using transmissions from BS to UE or vice versa), they vary relatively slowly.

Local calibrations, thus, are generally stable and do not change much over a period of several minutes (e.g., 30 minutes).

Eq. (40b) further reveals that the reverse MIMO channel can be mathematically modelled as the composition of a) a complex scalar, b) calibration coefficients at B, c) MIMO uplink channel transfer function, and d) calibration coefficients at A.

A pre-coder can be built at A (or at B), by acquiring calibration coefficients of the receiver side. The pre-coder implementation could be based on any of several pre-coders available in the literature. Some examples include: an MMSE pre-coder, a regularized MMSE precoder, a zero forcing precoder, a Tomlinson-Harashima pre-coder, and so on. As will be appreciated by one of skill in the art, either linear pre-coders (first three examples above) or non-linear pre-coders (the last example above) may be used.

To illustrate this point, an example embodiment of a reciprocity based zero-forcing (ZF) pre-coder using the data above (ref. Eq. 40b) is described below. The configuration of this pre-coder is depicted in FIG. 15. Note that, the same set of data can be used to design any type of pre-coder.

A ZF pre-coder may have the following form.

$\begin{matrix} {W = \frac{K_{A}^{- 1} \cdot H_{U}^{- 1} \cdot K_{B}^{- 1}}{E\left\{ {{K_{A} \cdot H_{U} \cdot_{B}}}_{F} \right\}}} & \left( {40c} \right) \end{matrix}$

Here, ∥⋅∥_(F) is the Frobenious norm of a given matrix. Note that ζ, the calibration coefficient between A and B does not appear in the pre-coder. The effect of ζ will be counteracted by the equalizer (single tap or MIMO) at the UEs.

Some embodiments use the fact that K_(B) and K_(A) are typically slow-varying, so that their inverse can be implemented in software (instead of implementing in hardware). In some embodiments, W2 (H_(U) ⁻¹ or inverse of H_(U)) may be fast varying and implemented in hardware circuits.

In some embodiments, W2 may be obtained as a by-product of the receiver Equalizer at the BS. For example BS equalizer often implements a variant of the H_(U) ⁻¹

Therefore, using the techniques disclosed herein, some embodiments may model the downlink channel as a composition of the uplink channel and slow varying local coefficients. This enables to build a variety of different pre-coders with minimal-feedback overhead, and certain linear precoders, use receiver equalizer computations performed at the base station.

Estimation of ζ or c_(a1b1) involves calibrating across BS and UE. For the reasons discussed above, these coefficients can be frequently varying and the estimation and feedback of these coefficients could consume a lot of bandwidth. Advantageously, a transmit-side pre-coder to cancel the multi-user interference can be designed without the knowledge of ζ. It can be designed from the upstream channel measurements K_(A) and K_(B), as described in the present document.

Several estimation methods to determine the calibration coefficients are described in the present document. When the number of antenna is relatively small, the method described in Section 4.C may be used. When a large number of antennas are involved, the method described in Section 4.D may be used.

4.C. Estimation of Calibration Coefficients (C_(x1x2))—Method 1—Iterative Algorithm

When the number of antenna is relatively small, such as 4 as in this example, an iterative algorithm can be used to compute the calibration coefficients. This, however, will entail a large amount of calibrations in a massive MIMO scenario and may become impractical. In a massive MIMO scenario, estimation described in sec. III may be used.

Iteration 1: c _(a1a3) =c _(a1a2) ˜c _(a2a3)  (41) c _(a1a4) =c _(a1a2) ·c _(a2a4)  (42)

Make an initial estimate of c_(a1a2), c_(a1a3), c_(a1a3), as described herein. Also estimate c_(a2a3) and c_(a2a4). Using the latter, make an alternative estimate of c_(a1a3) and c_(a1a4) (eq. 41 and 42). From these two independent estimates of c_(a1a3) and c_(a1a4), make a refined estimate of c_(a1a3) and c_(a1a4) (e.g., the arithmetic mean). A refined estimate of c_(a1a2) can be obtained from Eq. (41) or (42) c _(a1a4) =c _(a1a3) ·c _(a3a4)  (43)

A refined estimate of c_(a1a4) can be obtained (as described above), from a measurement of c_(a3a4) using Eq. (43). Using the updated c_(a1a4), estimates of c_(a1a2) and c_(a1a3) can be updated.

More iterations, in the above manner, can be performed to further refine the above coefficients.

The number of calibrations to be performed in this method is 4_(C2)=6. Number of calibrations will grow exponentially in N, the number of antenna; hence not practical for large array of antenna.

4.D. Estimation of Calibration Coefficients (C_(x1x2))—Method 2—Large Number of Antenna

When the number of antenna is high, e.g., 64, Method 1 is not practically feasible. This section describes a simple method for the same.

The following equations have been previously seen derived. ĥ _(a1a2) =c _(a1a2) ĥ _(a2a1)  (44) y _(a2) =ĥ _(a2a1) s _(a1) +n _(a2)  (45) y _(a1) =ĥ _(a2a1) s _(a2) +n _(a1)  (46)

where sa1, sa2 are known training symbols, y_(a1) and y_(a2) are the received signal and n is additive noise. It is assumed that the noise is white in the frequency band of interest. The LS estimates of

${\hat{h}}_{a\; 1a\; 2} = {{\frac{y_{a\; 2} \cdot s_{a\; 1}^{*}}{{s_{a\; 1}}^{2}}\mspace{14mu}{and}\mspace{14mu}{\hat{h}}_{a\; 2a\; 1}} = {\frac{y_{a\; 1} \cdot s_{a\; 2}^{*}}{{s_{a\; 2}}^{2}}.}}$ Note that the estimation error is

${{CN}\left( {0,\frac{\sigma_{n}^{2}}{{s_{b}}^{2}}} \right)}.$ Now

$c_{a\; 1a\; 2} = {\frac{{\hat{h}}_{a\; 1a\; 2}}{{\hat{h}}_{a\; 2a\; 1}}.}$ Similar expressions hold good for other calibration coefficients.

For a 64 antenna system, this method would use a total of 64 calibration signal transmissions.

4.E. Estimation of Calibration Coefficients (C_(x1x2))—Method 3—Using Total Least Squares (TLS)

What is described below is an algorithm to estimate the calibration coefficients using the method of total least squares.

Refer to Method 2. Take k (say 4) such LS estimates and form the following matrix H _(a1a2)=[ĥ _(a1a2,1) ,ĥ _(a1a2,2) ⋅ ⋅ ⋅ ĥ _(a1a2,4)]  (47) H _(a2a1)=[ĥ _(a2a1,1) ,ĥ _(a2a1,2) ⋅ ⋅ ⋅ ĥ _(a2a1,4)]  (48)

Let D=[H_(a2a1), H_(a1a2)]. Note that D is a 4×2 matrix in this example.

${\hat{c}}_{a\; 1a\; 2} = {{\underset{{\Delta\; H_{a\; 1a\; 2}},{\Delta\; H_{a\; 2a\; 1}}}{argmin}{{\Delta\; H_{a\; 2a\; 1}}}_{F}^{2}} + {{\Delta\; H_{a\; 1a\; 2}}}_{F}^{2}}$ subject to H_(a1a2)+ΔH_(a1a2)=(H_(a2a1)+ΔH_(a2a1))·c_(a1a2).

Solution for the above is obtained as below.

Let D=UΣV^(H) where Σ=diag (σ₁, σ₂), σ₁>σ₂, where σs are singular values of D; U and V are the left and right eigen-vectors respectively. Let

$\begin{matrix} {V = {\begin{bmatrix} v_{11} & v_{12} \\ v_{21} & v_{22} \end{bmatrix}.}} & (49) \end{matrix}$

To have a solution for this Total Least Squares problem, υ₂₂≠0. Only if σ₁≠σ₂, the solution will be unique.

The solution is given by,

${\hat{c}}_{{a\; 1a\; 2} - {opt}} = {\frac{- v_{12}}{v_{22}}.}$

In some embodiments, total least squares error optimization criteria may be used. Total least squares assumes that both h._((..)) and c._((..)) are subject to estimation errors. This is more realistic compared to assuming that h._((..)) is impervious to estimation errors.

Note that three different methods for estimating the calibration coefficients are described above. During the implementation/prototyping phase, effectiveness of each method can be evaluated separately and the one with the best merit need to be selected for the final implementation. Alternatively, the decision may be made based on the number of antennas for which the calibration is performed. For example, method 1 may be suitable for up to 8 receive and/or transmit antennas, while methods 2 or 3 may be used for higher number of antennas.

4.F. Effect of Delays in the TX/RX Path

Let delays associated with t_(a1), t_(a2), r_(a1) and r_(a2) be τ_(ta2), τ_(ta2), τ_(ra1), τ_(ra2). Therefore,

$\begin{matrix} \begin{matrix} {c_{a\; 1a\; 2} = {\frac{{t_{a\; 1} \cdot r_{a\; 2}}}{{r_{a\; 1} \cdot t_{a\; 2}}} \cdot \frac{e^{{- j}\; 2\pi\;{fr}_{a\; 2}} \cdot e^{{- j}\; 2\pi\;{fr}_{a\; 1}}}{e^{{- j}\; 2\pi\;{fr}_{a\; 1}} \cdot e^{{- j}\; 2\pi\;{fr}_{a\; 2}}}}} \\ {= {{c_{a\; 1a\; 2}} \cdot e^{{- j}\; 2\pi\; f\;\delta\; r}}} \end{matrix} & (50) \end{matrix}$

where δτ=(τ_(ta1)+τ_(ra2))−(τ_(ta2)+τ_(ra1)), the delay difference between the a₁ and a₂. It is clear that, the effect of δτ is to cause a linear phase on the calibration coefficients across the frequency.

Calibration coefficient as can be seen is a function of δτ. The delays in the digital sections of TX and RX will not affect the calibration coefficients, as these will cancel out in the expression above (Note that digital delays are identical for all transmitters. This is true for receivers as well). It is clear that, a delay effect, as described above, will be manifested if the synchronizing clocks at BS or UE are routed using long traces.

It has been assumed that t_(a1) etc. is memory-less. The case were t_(a1) for example is say a 2 tap filter is not considered in this formulation.

4.G. Calibration Coefficients when there is Mutual Coupling Between TX/TX, TX/RX Paths

Non-negligible coupling between different TX/RX path can exist due to a) Imperfect hardware design or more importantly b) if cross-polarized antenna is used in the design. Modifications to the calibration algorithm under these conditions is described below. It is assumed that there is no coupling between the TX and RX paths.

Referring to FIG. 13 and FIG. 14, assume that the receive paths have mutual coupling between them. For e.g., r_(a1a2) is the mutual coupling between receive paths r₁ and r₂. Similarly r_(a1a3) refers to the coupling between the receive paths r₁ and r₃. Similar explanation applies to mutual coupling between the transmit paths. Note that r_(a1a1) refers to r_(a1) of the Section 4.B.

Assume that antenna a1 transmits a calibration sequence, sa1. It has been received by receive antenna a₂, a₃ and a₄. Similar to the formulation in Sections 4.B. and 4.C., the following expressions can be derived.

$\begin{matrix} {\begin{bmatrix} y_{a\; 2}^{\prime} \\ y_{a\; 3}^{\prime} \\ y_{a\; 4}^{\prime} \end{bmatrix} = {{{\begin{bmatrix} r_{a\; 2a\; 2} & r_{a\; 2a\; 3} & r_{a\; 2a\; 4} \\ r_{a\; 3a\; 2} & r_{a\; 3a\; 3} & r_{a\; 3a\; 4} \\ r_{a\; 4a\; 2} & r_{a\; 4a\; 3} & r_{a\; 4a\; 4} \end{bmatrix}\begin{bmatrix} h_{a\; 1a\; 2} \\ h_{a\; 1a\; 3} \\ h_{a\; 1a\; 4} \end{bmatrix}}{t_{a\; 1} \cdot s_{a\; 1}}} + \begin{bmatrix} n_{a\; 2} \\ n_{a\; 3} \\ n_{a\; 4} \end{bmatrix}}} & (51) \end{matrix}$

$\begin{matrix} {\begin{bmatrix} y_{a\; 1}^{n} \\ y_{a\; 3}^{n} \\ y_{a\; 4}^{n} \end{bmatrix} = {{{\begin{bmatrix} r_{a\; 1a\; 1} & r_{a\; 1a\; 3} & r_{a\; 1a\; 4} \\ r_{a\; 3a\; 1} & r_{a\; 3a\; 3} & r_{a\; 3a\; 4} \\ r_{a\; 4a\; 1} & r_{a\; 4a\; 3} & r_{a\; 4a\; 4} \end{bmatrix}\begin{bmatrix} h_{a\; 2a\; 1} \\ h_{a\; 2a\; 3} \\ h_{a\; 2a\; 4} \end{bmatrix}}{t_{a\; 2} \cdot s_{a\; 2}}} + \begin{bmatrix} n_{a\; 1} \\ n_{a\; 3} \\ n_{a\; 4} \end{bmatrix}}} & (52) \\ {\begin{bmatrix} y_{a\; 1}^{m} \\ y_{a\; 2}^{m} \\ y_{a\; 4}^{m} \end{bmatrix} = {{{\begin{bmatrix} r_{a\; 1a\; 1} & r_{a\; 1a\; 2} & r_{a\; 1a\; 4} \\ r_{a\; 2a\; 1} & r_{a\; 2{a2}} & r_{a\; 2a\; 4} \\ r_{a\; 4a\; 1} & r_{a\; 4{a2}} & r_{a\; 4a\; 4} \end{bmatrix}\begin{bmatrix} h_{a\; 3a\; 1} \\ h_{a\; 3a\; 2} \\ h_{a\; 3a\; 4} \end{bmatrix}}{t_{a\; 3} \cdot s_{a\; 3}}} + \begin{bmatrix} n_{a\; 1} \\ n_{a\; 2} \\ n_{a\; 4} \end{bmatrix}}} & (53) \\ {\begin{bmatrix} y_{a\; 1}^{mn} \\ y_{a\; 2}^{mn} \\ y_{a\; 3}^{mn} \end{bmatrix} = {{{\begin{bmatrix} r_{a\; 1a\; 1} & r_{a\; 1a\; 2} & r_{a\; 1a\; 3} \\ r_{a\; 2a\; 1} & r_{a\; 2a\; 2} & r_{a\; 2a\; 3} \\ r_{a\; 3a\; 1} & r_{a\; 3a\; 2} & r_{a\; 3a\; 2} \end{bmatrix}\begin{bmatrix} h_{a\; 4a\; 1} \\ h_{a\; 4a\; 2} \\ h_{a\; 4a\; 3} \end{bmatrix}}{t_{a\; 4} \cdot s_{a\; 4}}} + \begin{bmatrix} n_{a\; 1} \\ n_{a\; 2} \\ n_{a\; 3} \end{bmatrix}}} & (54) \end{matrix}$

Proceeding as in Section 4.D., LS estimates of ĥ_(a1a2), ĥ_(a2a3) and ĥ_(a1a4) can be obtained from Eq. (51). The term ĥ_(a1a2) is the non-reciprocal (baseband) channel from antenna a1 to antenna a2, whereas h_(a1a2) is the reciprocal radio channel from antenna a1 to antenna a2g. Similarly, LS estimates ĥ_(a2a1){circumflex over ( )}, ĥ_(a3a1){circumflex over ( )} and ĥ_(a1a1){circumflex over ( )} can be obtained from equations 52, 53 and 54.

$\begin{matrix} {\begin{bmatrix} {\hat{h}}_{a\; 1a\; 2} \\ {\hat{h}}_{a\; 1a\; 3} \\ {\hat{h}}_{a\; 1a\; 4} \end{bmatrix} = {t_{a\; 1} \cdot {\begin{bmatrix} r_{a\; 2a\; 2} & r_{a\; 2a\; 3} & r_{a\; 2a\; 4} \\ r_{a\; 3a\; 2} & r_{a\; 3a\; 3} & r_{a\; 3a\; 4} \\ r_{a\; 4a\; 2} & r_{a\; 4a\; 3} & r_{a\; 4a\; 4} \end{bmatrix}\begin{bmatrix} h_{a\; 1a\; 2} \\ h_{a\; 1a\; 3} \\ h_{a\; 1a\; 4} \end{bmatrix}}}} & (55) \\ {\begin{bmatrix} {\hat{h}}_{a\; 2a\; 1} \\ {\hat{h}}_{a\; 3a\; 1} \\ {\hat{h}}_{a\; 4a\; 1} \end{bmatrix} = {\begin{bmatrix} {r_{a\; 1a\; 1} \cdot t_{a\; 2}} & {r_{a\; 1a\; 3} \cdot t_{a\; 2}} & {r_{a\; 1a\; 4} \cdot t_{a\; 2}} \\ {r_{a\; 1a\; 1} \cdot t_{a\; 3}} & {r_{a\; 1a\; 2} \cdot t_{a\; 3}} & {r_{a\; 1a\; 4} \cdot t_{a\; 3}} \\ {r_{a\; 1a\; 1} \cdot t_{a\; 4}} & {r_{a\; 1a\; 2} \cdot t_{a\; 4}} & {r_{a\; 1a\; 3} \cdot t_{a\; 4}} \end{bmatrix}\begin{bmatrix} h_{a\; 2a\; 1} \\ h_{a\; 3a\; 1} \\ h_{a\; 4a\; 1} \end{bmatrix}}} & (56) \end{matrix}$

From Eq. 55 and 56, we can write the following

$\begin{matrix} {\begin{bmatrix} {\hat{h}}_{a\; 2a\; 1} \\ {\hat{h}}_{a\; 3a\; 1} \\ {\hat{h}}_{a\; 4a\; 1} \end{bmatrix} = {\underset{\underset{c}{︸}}{\frac{1}{t_{a\; 1}} \cdot {\begin{bmatrix} {r_{a\; 1a\; 1} \cdot t_{a\; 2}} & {r_{a\; 1a\; 3} \cdot t_{a\; 2}} & {r_{a\; 1a\; 4} \cdot t_{a\; 2}} \\ {r_{a\; 1a\; 1} \cdot t_{a\; 3}} & {r_{a\; 1a\; 2} \cdot t_{a\; 3}} & {r_{a\; 1a\; 4} \cdot t_{a\; 3}} \\ {r_{a\; 1a\; 1} \cdot t_{a\; 4}} & {r_{a\; 1a\; 2} \cdot t_{a\; 4}} & {r_{a\; 1a\; 3} \cdot t_{a\; 4}} \end{bmatrix}\begin{bmatrix} r_{a\; 2a\; 2} & r_{{a\; 2{a3}}\;} & r_{a\; 2a\; 4} \\ r_{a\; 3a\; 2} & r_{a\; 3a\; 3} & r_{a\; 3a\; 4} \\ r_{a\; 4a\; 2} & r_{a\; 4a\; 3} & r_{a\; 4a\; 4} \end{bmatrix}}^{- 1}}{\quad\begin{bmatrix} {\hat{h}}_{a\; 1a\; 2} \\ {\hat{h}}_{a\; 1a\; 3} \\ {\hat{h}}_{a\; 1a\; 4} \end{bmatrix}}}} & (57) \end{matrix}$

where C is the calibration coefficient to be estimated. It is interesting to note that when the mutual coupling coefficients are set to 0, the above equation gives raise to eq. 33. Similarly ĥ_(a2a3) ĥ_(a2a4) and ĥ_(a3a4) can be expressed in terms of the product of a calibration matrix and ĥ_(a3a2), ĥ_(a4a2) and ĥ_(a4a3).

These calibration coefficients can be computed using Total Least Squares method (method 3).

Note that there is no mutual coupling between sides A and B. This enables embodiments to write downstream link exactly as in Eq. 40c. However, in this case, K_(A) and K_(B) will no longer be diagonal matrices.

5. Embodiments and Method for the Disclosed Technology

FIG. 16 is a block diagram representation of a wireless hardware platform 1600 which may be used to implement the various methods described in the present document. The hardware platform 1600 may be incorporated within a base station or a user device. The hardware platform 1600 includes a processor 1602, a memory 1604 and a transceiver circuitry 1606. The processor 1602 may execute instructions, e. g., by reading from the memory 1604, and control the operation of the transceiver circuitry 1606 and the hardware platform 1600 to perform the methods described herein. In some embodiments, the memory, processor and transceiver may be included in a single chip solution.

FIG. 17 shows an example of a wireless communication system 1700 in which a transmitter device 1702 transmits signals to a receiver 1704. The signals may undergo various wireless channels and multipaths, as depicted. Some reflectors such as buildings and trees may be static, while others such as cars, may be moving scatterers. The transmitter device 1702 may be, for example, a mobile phone, a tablet, a computer, or another Internet of Things (IoT) device such as a smartwatch, a camera, and so on. The receiver device 1704 may be a network device such as the base station. The signals transmitted from the base station to the transmitter 1702 may experience similar channel degradations produced by static or moving scatterers. The techniques described in the present document may be implemented by the devices in the wireless communication system 1700.

FIG. 18 is a flowchart for an example method 1800 for wireless communication. The method 1800 may be implemented by a base station in a wireless network. The method 1800 includes receiving (1802), by a first wireless device (e.g., the base station) during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas, estimating (1804), by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device, and performing (1806) channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number.

As previously described, the training phase may be based on a pre-defined number of repetitions of the reference signal transmission, or may be dependent on passage of a time, such as 10 to 20 seconds, during which the training is performed. The estimation operation 1804 may be performed by solving for the various equations described herein.

Upon the base station deciding that the training phase is over, then the base station may begin operating in the operational phase. The transition from the training phase to the operational phase may be communicated to user devices via an over-the-air message transmission. Alternative, the user devices and the base station may keep track of number of reference signal transmissions performed, and enter operational phase after a pre-defined threshold is exceeded.

As described herein, during operational phase, a reduced number of resource elements may be used for reference signal transmissions. In some embodiments, this number may be selected to be a fixed number that is known to both the transmitter and the receiver. In general, this number is less (or far less) than the first number of reference tones used during the training phase. As previously discussed, preferably sufficient reference tones are transmitted and received so that the essential parameters of the channel can be extracted.

The second order statistics may be measured in one of two different techniques as described here. In one technique, called the averaging method, the channel matrix is formulated as an average of autocovariance of an estimated channel response over all the receiving antennas of the first wireless device, at different time instances. In another technique, called, the direct method, includes estimating covariance of a channel matrix using a direct method in which the channel matrix is formulated to comprise a number of columns, wherein each column comprises an estimated channel response over all the receiving antennas of the first wireless device at a time instance. Further details are described with reference to equations (1) to (3).

During the operational phase, the method 700 may include performing channel estimation using an interpolation filter that interpolates from a decimated version of the channel estimate onto the entire channel estimate. Some example embodiments are provided with respect to Equations (5) to (9).

The method 1800 may further include estimating an error covariance matrix representative of an error in the estimated channel response over all of the receiving antennas computed by interpolating channel estimates; and selectively revising, for future use, the second number of resource elements of reference tones using a measure of the error covariance matrix. The measure of error covariance may be the comparison between a sum of squares of diagonal entries with a threshold, as described with respect to Equation (10) and (11).

FIG. 19 is a flowchart for an example method 1900 of wireless communication. The method 1900 may be implemented by a user device (user equipment) in a wireless system. The method includes transmitting (1902), to multiple receive antennas of a first wireless device from a transmit antenna of a second wireless device, during a training phase, reference tones using a first number of resource elements of a wireless channel between the transmit antenna and the multiple receive antennas, receiving (1904), at an end of the training phase, an instruction to transmit reference tones using a second number of resource elements, and transmitting (1906), during an operational phase after the training phase, reference tones to the multiple receive antennas of the first wireless device using the second number of resource elements, wherein the second number is different from the first number and wherein the second number is based on an estimated second order statistics of the wireless channel.

In some embodiments, the method 1900 further includes receiving, during the operational phase, another instruction to transmit reference tones using a third number of resource elements, wherein the third number is different from the first number and the second number, and transmitting, after receiving the another instruction, reference tones to the first wireless device using the third number of resource elements. For example, the base station may decide that the reduced number of reference tones may have to be adjusted upwards (if seeing too many errors, see equations (9) and (10)) or adjusted lower when the number of reflectors in the channel is less than what was observed in the training phase. As previously described, the lower number of reference signal overhead can improve the efficiency of a wireless channel by making greater bandwidth for data traffic.

FIG. 20 discloses another method 2000 of wireless communication. The method 2000 includes estimating (2002), during a training phase, a second order statistics for a first wireless channel and a second wireless channel between a transmitter and a receiver comprising multiple antennas, wherein the second order statistics is estimated using reference tones transmitted on a first number of resource elements, predicting (2004), during an operational phase subsequent to the training phase, an estimate of the second wireless channel based on the second order statistics and an estimate of the first wireless channel calculated using reference tones transmitted on a second number of resource elements, where the second number is less than the first number, and communicating (2006), during the operational phase, over the second wireless channel using the estimate of the second wireless channel resulting from the predicting, wherein the first wireless channel and the second wireless channel include non-overlapping frequencies.

In some embodiments, the second order statistics may include a cross-covariance between an estimate of the first wireless channel and an estimate of the second wireless channel. The estimates of the first and second wireless channels may be obtained during different time periods (e.g., training phases that are offset in time with respect to each other). Sections 2 and 3 have provided additional details used by the method 2000.

In the methods 1800, 1900 and 2000, the resource elements may represent time slots or subcarriers. The reference tone transmission during the training phase may occur on non-contiguous frequencies.

It will be appreciated that technique for reducing the amount of transmission resources used for reference signal transmissions are disclosed. Using the disclosed techniques, e.g., determination of second order statistics, calculation of an interpolation filter, and interpolating based on the interpolation filter, can be used to reduce the number of pilot transmissions after an initial training phase in which an estimate of the channel and its second order statistics are obtained. The reduced number of transmissions is sufficient as long as these transmissions provide sufficient information via diversity in angle of arrival, number of transmissions and resources used for transmissions such that the receiver is able to discern the wireless channel characteristics, e.g., dominant reflectors in the channel. This reduced set of number may be fixed a priori (e.g., based on a general knowledge of the expected channel under which the wireless communication is to operate) or may be changed from time to time based on the disclosed error measurements. As an illustrative example, if a wireless channel is characterized by 8 dominant reflectors, it may be sufficient to send a single reference tone to 8 receive antennas of a base station from a transmit antenna (e.g., a user device) to estimate and predict the entire channel both in the uplink and in the downlink directions, and at future transmission times.

FIG. 21 is a flowchart for an example method 600 of wireless communication. At 2102, a first communication device receives a number of subcarriers from a second communication device. Each subcarrier includes a corresponding reference signal. For example, the first communication device may be Terminal B in FIG. 3B. In some embodiments, the first communication device may be a user equipment (UE) or a wireless terminal that is incorporated into a phone, camera, laptop, tablet, Internet of Things (IoT) device or another device capable of received and transmitting wireless signals. In some embodiments, the second communication device may be the above-discussed Terminal A. In some embodiments, the second communication device may be a base station, an access point, Hub 102 (in FIG. 1), macro tower 202 (in FIG. 2), or another network-side device that is providing communication connectivity to multiple devices such as the first communication device.

In some embodiments, the receiving operation 2102 may occur in a single time slot of a TDD communication system. Alternatively, the reference signal transmissions over the subcarriers may be received over multiple time slots. Similarly, in some implementations, multiple reference signal transmissions on a same subcarrier may be received over multiple timeslots and the results may be averaged to reduce effect of noise on the various calculations described herein.

At 2102, the first communication device may calculate an inversion factor for each subcarrier based on the received value of the reference signal received on respective subcarrier. As described in the present document, e.g., equation (28), a zero forcing technique to ensure numerical stability of the calculation may be used. The regularized zero forcing technique, for example, eliminates singularity caused by zero or low valued denominator of Equation (28).

At 2106, the first communication device may transmit pilot signals back to the second communication device. The pilot signals are scaled by the inversion factor calculated for the subcarrier on which the pilot is being transmitted.

As described in the present document, one of the advantageous aspect of the method 2100 is that each inversion factor is a scalar. Inversion factors may be rational numbers or, in general, complex numbers representing both a scale and a phase shift for the subcarrier.

In some embodiments, the pilot signal and the reference signals may both be unit signals. For example, the pilot and reference signals may simply multiply a pre-determined subcarrier level by a factor of 1. Alternatively, other scaling factors may be used. Similarly, the reference signal may also simply multiply a nominal subcarrier level by a scale factor of 1. Other scale factors may be used for multiplying a nominal subcarrier value both to the first communication device, and from the subcarrier device. These scale factors may, for example, be selected such that the product of “to” and “from” scale factors for nominal subcarrier signal level scaling is 1.

As previously described, averaging may be performed by the first communication device, by repeating inversion factor calculations for subcarriers over multiple receptions.

FIG. 22 is a flowchart of an example method 2200 of wireless communication. The method 2200 may transmit reference signals and precoded signals to a first communication device from a second communication device. The first and the second communication devices may be embodied, for example, as described with respect to method 2100.

At 2202, the second communication device transmits reference signals using a number of subcarriers. The reference signals may simply scale by unity a nominal signal level of the subcarrier. Other scale factors may be used, as described with respect to method 2100. The reference signal transmissions may be performed in a single time slot. Alternatively, multiple reference signal transmissions may be performed over multiple time slots. The reference signal transmissions may be repeated as often as needed, e.g., based on the effectiveness of the subsequent pre-coding to achieve or maintain low error communication.

At 2204, the second communication device receives inversion factors in the form or scaled pilot signals from the first communication device, where the subcarriers that were used for reference signal transmissions are scaled by the corresponding inversion factor calculated by the first communication device.

At 2206, the second communication device may estimate the communication channel from the second communication device to the first communication device by generating values on all the subcarriers based on the inversion factors that were received on the subset of the subcarriers. For example, simple linear interpolation may be used for reduced computational complexity.

After an estimate of the communication channel based on the inversion factors is obtained, the second communication device may then computer a full channel response that also includes channel response of the reflectors. In some embodiments, second order statistics of the effect of the reflectors may be used for obtaining the full channel response.

In some embodiments, the first communication device is Terminal B described in the present document and depicted in FIG. 3B. Typically, multiple Terminal Bs may be present in a wireless communication system, with a single Terminal A, and possibly a secondary base station, will provide wireless access to multiple Terminal B's. In some embodiments, the second communication device is Terminal A described in the present document and depicted in FIG. 3B. With respect to the methods 600 and 700, the sparse set of subcarriers over which the reference signals (and subsequently pilot signals) may be transmitted may include every Mth subcarrier, such as every 8th or every 16th subcarrier. In some embodiments, a non-uniform group of subcarriers may be used.

In some embodiments, a wireless communication device (e.g., 1600) may include a processor and a transceiver circuitry such that the processor controls the operation of inversion factor calculations and the transceiver circuitry is used to transmit or receive the reference signals and the pilot signals.

It will be appreciated by one of skill in the art that the described receiver-side inversion is a novel approach for computing reciprocity calibration factors that has low feedback overhead and more favorable dynamic range requirements compared to existing solutions. For a given tone in the frequency domain, only one symbol transmission in each direction is required to obtain the reciprocity calibration factor, which greatly reduces overhead compared to feeding back channels as data samples. As such, it is well suited to enabling efficient bidirectional transmission in TDD wireless systems operating with a large number of both BS antennas and CPEs.

The following listing of examples provide embodiments that can addressed the technical problems described in the present document, among other problems.

1. A wireless communication method, comprising: receiving, by a first wireless device during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas; estimating, by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device; and performing channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number.

2. The method of example 1, wherein the estimating the second order statistics includes estimating covariance of a channel matrix using a direct method in which the channel matrix is formulated to comprise a number of columns, wherein each column comprises an estimated channel response over all the receiving antennas of the first wireless device at a time instance.

3. The method of example 1, wherein the estimating the second order statistics includes estimating covariance of a channel matrix using an averaging method in which the channel matrix is formulated as an average of autocovariance of an estimated channel response over all the receiving antennas of the first wireless device, at different time instances.

4. The method of example 1, wherein the performing the channel estimation includes: performing the channel estimation by interpolating channel estimates from the reference tones received on the second number of resource elements using an interpolation filter.

5. The method of example 1, further comprising: determining, using the second order statistics, an interpolation filter.

6. The method of example 5, wherein the determining the interpolation filter includes using a decimated version of a covariance matrix calculated during the training phase.

7. The method of example 6, wherein the determining the interpolation filter is performed by: determining an eigenvector factorization of the covariance matrix, wherein the eigenvector factorization is represented as: R_(HH)≈V·D·V*, wherein R_(HH) is the covariance matrix, V is an eigenvectors matrix and D is a diagonal matrix of eigenvalues, and * is a conjugate transpose operation; and estimating the interpolation filter as function of the eigenvectors matrix and a decimated version of the eigenvectors matrix.

8. The method of example 7, wherein the function is represented as C=V·(V_(M))⁻¹ where C represents the interpolation filter, V_(M) is the decimated version of V.

9. The method of example 5, further including: estimating an error covariance matrix representative of an error in the estimated channel response over all of the receiving antennas computed by interpolating channel estimates; and selectively revising, for future use, the second number of resource elements of reference tones using a measure of the error covariance matrix.

10. The method of example 9, wherein the measure of the error covariance matrix includes a comparison between a sum of squares of diagonal entries of the error covariance matrix and a threshold.

11. A method of wireless communication, comprising: transmitting, to multiple receive antennas of a first wireless device from a transmit antenna of a second wireless device, during a training phase, reference tones using a first number of resource elements of a wireless channel between the transmit antenna and the multiple receive antennas; receiving, at an end of the training phase, an instruction to transmit reference tones using a second number of resource elements; and transmitting, during an operational phase after the training phase, reference tones to the multiple receive antennas of the first wireless device using the second number of resource elements, wherein the second number is different from the first number and wherein the second number is based on an estimated second order statistics of the wireless channel.

12. The method of example 11, further including: receiving, during the operational phase, another instruction to transmit reference tones using a third number of resource elements, wherein the third number is different from the first number and the second number; and transmitting, after receiving the another instruction, reference tones to the first wireless device using the third number of resource elements.

13. The method of any of examples 1 to 12, wherein the resource elements comprise subcarriers.

14. The method of any of examples 1 to 12, wherein the resource elements comprise time slots.

15. The method of any of examples 1 to 14, wherein the second number of resource elements is equal to 1.

16. A wireless communication method, implementable by a wireless communication apparatus, comprising: estimating, during a training phase, a second order statistics for a first wireless channel and a second wireless channel between a transmitter and a receiver comprising multiple antennas, wherein the second order statistics is estimated using reference tones transmitted on a first number of resource elements; predicting, during an operational phase subsequent to the training phase, an estimate of the second wireless channel based on the second order statistics and an estimate of the first wireless channel calculated using reference tones transmitted on a second number of resource elements, where the second number is less than the first number; and communicating, during the operational phase, over the second wireless channel using the estimate of the second wireless channel resulting from the predicting; wherein the first wireless channel and the second wireless channel include non-overlapping frequencies.

17. The method of example 16, wherein the second order statistics comprises a cross-covariance between an estimate of the first wireless channel and an estimate of the second wireless channel.

18. The method of example 17, wherein the estimate of the first wireless channel and the estimate of the second wireless channel are obtained at different times.

19. The method of example 16 or 17, wherein the method is implemented by a base station in a frequency division duplexing (FDD) network.

20. The method of example 16 or 17, wherein the method is implemented by a base station in a time division duplexing (TDD) network.

21. The method of any of examples 1 to 20, wherein the reference tones during the training phase are transmitted over a non-contiguous spectrum.

22. A method of wireless communication, comprising: receiving, by a first communication device, a number of subcarriers from a second communication device, each including a corresponding reference signal; calculating an inversion factor for each subcarrier based on a received value of the corresponding reference signal; and transmitting by the first communication device to the second communication device, at least some of the subcarriers by scaling a pilot signal using a corresponding inversion factor.

23. The method of example 22, wherein the subcarriers are received in a single time slot.

24. The method of example 22, wherein the subcarriers are received over multiple time slots.

25. The method of any of examples 22 to 24, wherein the calculating the inversion factor includes using a regularized zero forcing technique, thereby avoiding singularities in calculations.

26. The method of example 22, wherein the inversion factor is a complex number.

27. The method of any of examples 22 to 26, wherein the scaling the pilot signal includes multiplying the pilot signal by the inversion factor.

28. The method of example 22, wherein the first communication device is a user terminal in a wireless network and the second communication device is a network device in the wireless network.

29. The method of example 25, wherein the calculating the inversion factor includes evaluating:

${{\overset{\sim}{H}}_{AB}^{- 1} = \frac{H_{AB}^{*}}{{H_{AB}^{*} \cdot H_{AB}} + N_{0}}},$ wherein {tilde over (H)}_(AB) ⁻¹ represents the inversion factor, H_(AB)* represents complex conjugate of the received value, and N₀ represents noise variance in received reference signals.

30. The method of example 29, wherein the calculating is repeated and averaged over multiple received reference signal transmissions for each subcarrier.

31. The method of any of examples 22 to 29, wherein the reference signal and the pilot signal are inverse functions of each other.

32. A method of wireless communication, comprising: transmitting, to a first communication device, from a second communication device, a number of subcarriers, each subcarrier including a corresponding reference signal; receiving, from the first communication device, at least some of the subcarriers carrying pilot signals scaled by inversions factors for the subcarriers; and estimating a communication channel between the second communication device to the first communication device using the inversion factors.

33. The method of example 32, wherein the estimating the communication channel includes interpolating inversion factors at intermediate subcarriers for which no inversion factors were received from the first communication device.

34. The method of example 32, wherein the corresponding reference signals transmitted on each subcarriers are identical.

35. The method of example 32, further including: performing a subsequent transmission from the second communication device to the first communication device by pre-coding using a result of the estimating the communication channel.

36. The method of example 35, wherein the pre-coding includes Tomlison-Harashima precoding.

37. The method of example 32, wherein the subcarriers on which reference signals are transmitted include every Mth subcarrier of the communication channel, where M is an integer greater than 1.

38. The method of example 32, wherein the estimating the communication channel further includes estimating contributions of reflectors to the communication channel using second order statistics.

39. The method of example 32, wherein the inversion factors are complex scalar numbers.

40. A wireless communication apparatus comprising: a processor; a non-transitory memory; and a wireless transceiver, wherein a method recited in one or more of examples 1 to 39 is stored in the non-transitory memory, and wherein the processor is configured to perform the method using the wireless transceiver for transmitting or receiving signals.

41. The wireless communication apparatus of example 22, wherein the wireless communication apparatus is a base station of a multi-user multi-input multi-output (MU-MIMO) wireless system.

The disclosed and other embodiments, modules and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this document can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While this patent document contains many specifics, these should not be construed as limitations on the scope of an invention that is claimed or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or a variation of a sub-combination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.

Only a few examples and implementations are disclosed. Variations, modifications, and enhancements to the described examples and implementations and other implementations can be made based on what is disclosed. 

What is claimed is:
 1. A wireless communication method, comprising: receiving, by a first wireless device during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas; estimating, by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device; and performing channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number, wherein performing the channel estimation comprises: interpolating channel estimates from the reference tones received on the second number of resource elements using an interpolation filter, and wherein the estimating the second order statistics includes estimating covariance of a channel matrix using (a) a direct method that formulates the channel matrix to comprise a number of columns, wherein each column comprises an estimated channel response over all the receiving antennas of the first wireless device at a time instance, or (b) an averaging method that formulates the channel matrix as an average of autocovariance of an estimated channel response over all the receiving antennas of the first wireless device at different time instances.
 2. The method of claim 1, further comprising: determining, using the second order statistics, the interpolation filter.
 3. The method of claim 2, further including: estimating an error covariance matrix representative of an error in the estimated channel response over all of the receiving antennas computed by interpolating the channel estimates; and selectively revising, for future use, the second number of resource elements of reference tones using a measure of the error covariance matrix.
 4. The method of claim 3, wherein the measure of the error covariance matrix includes a comparison between a sum of squares of diagonal entries of the error covariance matrix and a threshold.
 5. A wireless communication method, comprising: receiving, by a first wireless device during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas; estimating, by the first wireless device, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device; performing channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number, wherein performing the channel estimation comprises: interpolating channel estimates from the reference tones received on the second number of resource elements using an interpolation filter; and determining, using the second order statistics, the interpolation filter, wherein the determining the interpolation filter includes using a decimated version of a covariance matrix calculated during the training phase.
 6. The method of claim 5, wherein the determining the interpolation filter is performed by: determining an eigenvector factorization of the covariance matrix, wherein the eigenvector factorization is represented as: R _(HH) ≈V·D·V* wherein R_(HH) is the covariance matrix, V is an eigenvectors matrix and D is a diagonal matrix of eigenvalues, and * is a conjugate transpose operation; and estimating the interpolation filter as function of the eigenvectors matrix and a decimated version of the eigenvectors matrix.
 7. The method of claim 6, wherein the function is represented as C=V·(V_(M))⁻¹, where C represents the interpolation filter, V_(M) is the decimated version of V.
 8. A method of wireless communication, comprising: transmitting, to multiple receive antennas of a first wireless device from a transmit antenna of a second wireless device, during a training phase, reference tones using a first number of resource elements of a wireless channel between the transmit antenna and the multiple receive antennas; receiving, at an end of the training phase, an instruction to transmit reference tones using a second number of resource elements; transmitting, during an operational phase after the training phase, reference tones to the multiple receive antennas of the first wireless device using the second number of resource elements, wherein the second number is different from the first number, wherein the second number is based on an estimated second order statistics of the wireless channel, wherein the first wireless device is configured to perform channel estimation during the operational phase, and wherein performing the channel estimation comprises interpolating channel estimates from the reference tones received on the second number of resource elements using an interpolation filter; receiving, during the operational phase, another instruction to transmit reference tones using a third number of resource elements, wherein the third number is different from the first number and the second number; and transmitting, after receiving the another instruction, reference tones to the first wireless device using the third number of resource elements.
 9. The method of claim 8, wherein the resource elements comprise subcarriers.
 10. The method of claim 8, wherein the resource elements comprise time slots.
 11. The method of claim 8, wherein the second number is less than the first number.
 12. The method of claim 8, wherein the second number is a pre-defined number.
 13. The method of claim 8, wherein the training phase may be based on a pre-defined number of repetitions of reference signal transmissions or on passage of a pre-defined time.
 14. The method of claim 8, wherein the transition from the training phase to the operational phase is transmitted from the first wireless device to the second wireless device.
 15. A first wireless communication device, comprising: a transceiver configured to receive, during a training phase, reference tones using a first number of resource elements from a transmitter of a second wireless device, wherein the first wireless device comprises multiple receiving antennas; and a processor configured to: estimate, from the receiving the reference tones, a second order statistics of wireless channels between the multiple receiving antennas and the transmitter of the second wireless device; and perform channel estimation, during an operational phase subsequent to the training phase, using the second order statistics and reference tones received on a second number of resource elements, wherein the second number is less than the first number, wherein the channel estimation is performed by: interpolating channel estimates from the reference tones received on the second number of resource elements using an interpolation filter, and wherein the estimating the second order statistics includes estimating covariance of a channel matrix using (a) a direct method that formulates the channel matrix to comprise a number of columns, wherein each column comprises an estimated channel response over all the receiving antennas of the first wireless device at a time instance, or (b) an averaging method that formulates the channel matrix as an average of autocovariance of an estimated channel response over all the receiving antennas of the first wireless device at different time instances.
 16. The first wireless communication device of claim 15, wherein the processor is further configured to: determine, using the second order statistics, the interpolation filter.
 17. The first wireless communication device of claim 15, wherein the processor is further configured to: estimate an error covariance matrix representative of an error in the estimated channel response over all of the receiving antennas computed by interpolating the channel estimates; and selectively revise, for future use, the second number of resource elements of reference tones using a measure of the error covariance matrix.
 18. The first wireless communication device of claim 17, wherein the measure of the error covariance matrix includes a comparison between a sum of squares of diagonal entries of the error covariance matrix and a threshold. 